The union-closed sets conjecture almost holds for almost all random bipartite graphs Henning Bruhn and Oliver Schaudt Abstract Frankl’s union-closed sets conjecture states that in every finite unionclosed family of set

Source URL: www.zaik.uni-koeln.de

• Graph theory
• Mathematics
• Graph coloring
• Combinatorial optimization
• Matching
• NP-complete problems
• Bipartite graph
• Union-closed sets conjecture
• Maximal independent set
• Triangle-free graph

9th International Symposium on Experimental Algorithms May, 2010 – Hotel Continental Terme, Ischia (Naples), Italy Call for Papers Program Committee David A. Bader (Georgia Inst. of Technology, USA)

Source URL: www.sea2010.unina.it

• Theoretical computer science
• Computational complexity theory
• Giuseppe F. Italiano
• Combinatorial optimization
• Algorithm
• Kurt Mehlhorn
• Mathematical optimization
• Mathematics
• Science and technology in Germany
• Computer science

Decision-aid Methodology for the School Bus Routing and Scheduling Problem Michela Spada, ROSO-IMA-EPFL Michel Bierlaire, ROSO-IMA-EPFL Thomas Liebling, ROSO-IMA-EPFL

Source URL: www.strc.ch

• Operations research
• Combinatorial optimization
• Mathematical optimization
• NP-complete problems
• Travelling salesman problem
• Integer programming
• School bus
• Branch and bound
• Bus
• Heuristic
• Lagrangian relaxation

Almost partitioning any 3-edge-coloured Kn,n into 5 monochromatic cycles Richard Lang, Oliver Schaudt, Maya Stein∗ 30th SeptemberAbstract

Source URL: www.zaik.uni-koeln.de

• NP-complete problems
• Combinatorial optimization
• Graph coloring
• Matching
• Cycle
• Bipartite graph
• Graph

How to Grow More Pairs: Suggesting Review Targets For Comparison-Friendly Review Ecosystems James Cook ∗ UC Berkeley

Source URL: www2013.wwwconference.org

• Mathematics
• NP-complete problems
• Combinatorics
• Discrete mathematics
• Greedy algorithm
• Matroid theory
• Set cover problem
• Algorithm
• Combinatorial optimization

On the Costs and Benets of Pro rastination: Approximation Algorithms for Sto hasti Combinatorial Optimization Problems Ni ole Immorli a David Karger

Source URL: www.immorlica.com

Scalable Active Matching Ankur Handa, Margarita Chli, Hauke Strasdat and Andrew J. Davison Department of Computing, Imperial College London, UK {ahanda, mchli, strasdat, ajd}@doc.ic.ac.uk Abstract

Source URL: www.margaritachli.com

• Artificial intelligence
• Statistics
• Mathematics
• Machine learning
• Graphical models
• Probability theory
• Combinatorial optimization
• Matching
• Pattern recognition
• Random sample consensus
• Mixture model
• Simultaneous localization and mapping

Ilya Razenshteyn September 15, 2015 Resear interests Similarity search, sketching, metric embeddings, high-dimensional geometry, streaming algorithms, compressed sensing, combinatorial optimization.

Source URL: ilyaraz.org

Convex Partitions with 2-Edge Connected Dual Graphs Marwan Al-Jubeh∗ Michael Hoffmann† Diane L. Souvaine∗

Source URL: www.cs.rpi.edu

• Mathematics
• Graph theory
• Elementary geometry
• Graph connectivity
• Combinatorial optimization
• Graph operations
• Planar graphs
• Dual graph
• Graph
• Line segment
• Cut
• Bridge

A Class of Greedy Algorithms And Its Relation to Greedoids Srinivas Nedunuri Dept. of Computer S ien es University of Texas at Austin

Source URL: www.kestrel.edu

• Mathematics
• Combinatorial optimization
• Greedoid
• Order theory
• Matroid
• Category theory
• Universal property
• Morphism